منابع مشابه
Donation Center Location Problem ∗ Chien
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theoretic problem. Given a set of agents and a set of centers, where agents have preferences over centers and centers have capacities, the goal is to open a subset of centers and to assign a maximum-sized subset of agents ...
متن کاملClassical Center Location Problem Under Uncertain Environment
This paper investigates the $p$-center location problem on a network in which vertex weights and distances between vertices are uncertain. The concepts of the $alpha$-$p$-center and the expected $p$-center are introduced. It is shown that the $alpha$-$p$-center and the expected $p$-center models can be transformed into corresponding deterministic models. Finally, linear time algorithms for find...
متن کاملNational Embryo Donation Center
The National Embryo Donation Center [4] (NEDC) is a non-profit organization [5] that was established in 2002 in Knoxville, Tennessee. The organization [5] is endorsed and supported by several Christian-based associations such as the Christian Medical Association [6], Bethany Christian Services, and Baptist Health Systems. Its goal is to provide embryo donation [7] and embryo adoption [8] servic...
متن کاملDouble bound method for solving the p-center location problem
We give a review of existing methods for solving the absolute and vertex restricted p-center problems on networks and propose a new integer programming formulation, a tightened version of this formulation and a new method based on successive restrictions of the new formulation. A specialization of the new method with two-element restrictions obtains the optimal p-center solution by solving a se...
متن کاملThe inverse 1-center location problem on a tree
In an inverse network 1-center location problem the parameters of a given network, like edge lengths or vertex weights, have to be modified at minimum total cost such that a prespecified vertex s becomes a 1-center of the network. In this paper, we consider the inverse 1-center location problem on an unweighted tree network T with n + 1 vertices in which we are allowed to increase or reduce the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2012
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-012-9633-7